Adaptive Deconvolution-Based Stereo Matching Net for Local Stereo Matching
نویسندگان
چکیده
In deep learning-based local stereo matching methods, larger image patches usually bring better accuracy. However, it is unrealistic to increase the size of patch without restriction. Arbitrarily extending will change method into global method, and accuracy be saturated. We simplified existing Siamese convolutional network by reducing number parameters propose an efficient CNN based structure, namely adaptive deconvolution-based disparity net (ADSM net) adding deconvolution layers learn how enlarge input feature map for following convolution layers. Experimental results on KITTI2012 2015 datasets demonstrate that proposed can achieve a good trade-off between complexity.
منابع مشابه
Local Stereo Matching Using Adaptive Local Segmentation
We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The preprocessing step smoothes low textured areas and sharpens texture edges, whereas the postprocess...
متن کاملNeural adaptive stereo matching
The present work investigates the potential of neural adaptive learning to solve the correspondence problem within a two-frame adaptive area matching approach. A novel method is proposed based on the use of the Zero Mean Normalized Cross Correlation Coefficient integrated within a neural network model which use least-mean-square delta rule for training. Two experiments were conducted for evalua...
متن کاملCooperative Stereo Matching with Color-Based Adaptive Local Support
Color processing imposes a new constraint on stereo vision algorithms: The assumption of constant color on object surfaces used to align local correlation windows with object boundaries has improved the accuracy of recent window based stereo algorithms significantly. While several algorithms have been presented that work with adaptive correlation windows defined by color similarity, only a few ...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملShader-Based Stereo Matching with Local Algorithms
Modern graphic cards can perform extreme amounts of calculations. In addition, the problem within the field of computer vision is often that the algorithms are very time consuming. The objective of this thesis is to find solutions to the stereo matching problem, employing dense local two-frame stereo matching algorithms and hardware support within modern graphic cards. The performance of the im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2022
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app12042086